Building block hypothesis shows that ga has ability of finding the global optimum solution 而積木塊假設(shè)卻說明了遺傳算法具備尋找到全局最優(yōu)解的能力。
The paper discusses the basic theory of genetic algorithms including schemate theorem , building block hypothesis , implicit parallelism , the analysis of astringency and so on , as the theoretical base of application 在對遺傳算法的闡述中,討論了遺傳算法的基本原理,包括模式定理、積木塊假設(shè)、隱含并行性和遺傳算法的收斂性分析等,作為后面遺傳算法應(yīng)用的理論依據(jù)。